"use strict";
/*
 * Copyright (c) 2022 Huawei Device Co., Ltd.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
let ID_IDLE = 0;
let ID_WORKER = 1;
let ID_HANDLER_A = 2;
let ID_HANDLER_B = 3;
let ID_DEVICE_A = 4;
let ID_DEVICE_B = 5;
let NUMBER_OF_IDS = 6;
let KIND_DEVICE = 0;
let KIND_WORK = 1;
/**
 * The task is running and is currently scheduled.
 */
let STATE_RUNNING = 0;
/**
 * The task has packets left to process.
 */
let STATE_RUNNABLE = 1;
/**
 * The task is not currently running.  The task is not blocked as such and may
 * be started by the scheduler.
 */
let STATE_SUSPENDED = 2;
/**
 * The task is blocked and cannot be run until it is explicitly released.
 */
let STATE_HELD = 4;
let STATE_SUSPENDED_RUNNABLE = STATE_SUSPENDED | STATE_RUNNABLE;
let STATE_NOT_HELD = ~STATE_HELD;
let DATA_SIZE = 4;
let COUNT = 1000;
/**
 ** These two constants specify how many times a packet is queued and
 ** how many times a task is put on hold in a correct run of richards.
 ** They don't have any meaning a such but are characteristic of a
 ** correct run so if the actual queue or hold count is different from
 ** the expected there must be a bug in the implementation.
 **/
let EXPECTED_QUEUE_COUNT = 2322;
let EXPECTED_HOLD_COUNT = 928;
// Generator
// Base classes for different task type
class BaseTask {
    constructor(scheduler) {
        this.scheduler = scheduler;
    }
    run(packet) {
        return new TaskControlBlock(null, 0, 0, packet, null);
    }
    toString() {
        return 'BaseTask';
    }
}
class IdleTask extends BaseTask {
    /**
     * An idle task doesn't do any work itself but cycles control between the two
     * device tasks.
     * @param {Scheduler} scheduler the scheduler that manages this task
     * @param {number} v1 a seed value that controls how the device tasks are scheduled
     * @param {number} count the number of times this task should be scheduled
     * @constructor
     */
    constructor(scheduler, v1, count) {
        super(scheduler);
        this.v1 = v1;
        this.count = count;
    }
    run() {
        const NUMBER_D008 = 0xd008;
        this.count -= 1;
        if (this.count === 0) {
            return this.scheduler.holdCurrent();
        }
        if ((this.v1 & 1) === 0) {
            this.v1 = this.v1 >> 1;
            // release ID_DEVICE_A
            return this.scheduler.release(ID_DEVICE_A);
        }
        else {
            this.v1 = (this.v1 >> 1) ^ NUMBER_D008;
            // release ID_DEVICE_B
            return this.scheduler.release(ID_DEVICE_B);
        }
    }
    toString() {
        return 'IdleTask';
    }
}
class WorkerTask extends BaseTask {
    /**
     * A task that manipulates work packets.
     * @param {Scheduler} scheduler the scheduler that manages this task
     * @param {number} v1 a seed used to specify how work packets are manipulated
     * @param {number} v2 another seed used to specify how work packets are manipulated
     * @constructor
     */
    constructor(scheduler, v1, v2) {
        super(scheduler);
        this.v1 = v1;
        this.v2 = v2;
    }
    run(packet) {
        if (packet == null) {
            return this.scheduler.suspendCurrent();
        }
        else {
            const V2_MAX = 26;
            if (this.v1 === ID_HANDLER_A) {
                // swich v1 value
                this.v1 = ID_HANDLER_B;
            }
            else {
                this.v1 = ID_HANDLER_A;
            }
            // set packet id
            packet.id = this.v1;
            packet.a1 = 0;
            for (let i = 0; i < DATA_SIZE; i++) {
                this.v2 += 1;
                if (this.v2 > V2_MAX) {
                    this.v2 = 1;
                }
                packet.a2[i] = this.v2;
            }
            return this.scheduler.queue(packet);
        }
    }
    toString() {
        return 'WorkerTask';
    }
}
class HandlerTask extends BaseTask {
    constructor(scheduler) {
        // this.scheduler=scheduler
        super(scheduler);
        // scheduler: Scheduler
        this.v1 = null;
        this.v2 = null;
    }
    /**
     * A task that manipulates work packets and then suspends itself.
     * @param {Scheduler} scheduler the scheduler that manages this task
     * @constructor
     */
    run(packet) {
        var _a, _b, _c, _d;
        if (packet != null) {
            if (packet.kind === KIND_WORK) {
                //  add packet v1
                this.v1 = packet.addTo(this.v1);
            }
            else {
                // add packet v2
                this.v2 = packet.addTo(this.v2);
            }
        }
        if (this.v1 != null) {
            let count = (_a = this.v1) === null || _a === void 0 ? void 0 : _a.a1;
            let v = this.v2;
            if (count < DATA_SIZE) {
                if (this.v2 != null) {
                    v = this.v2;
                    this.v2 = (_b = this.v2) === null || _b === void 0 ? void 0 : _b.link;
                    v.a1 = (_c = this.v1) === null || _c === void 0 ? void 0 : _c.a2[count];
                    this.v1.a1 = count + 1;
                    return this.scheduler.queue(v);
                }
            }
            else {
                v = this.v1;
                this.v1 = (_d = this.v1) === null || _d === void 0 ? void 0 : _d.link;
                return this.scheduler.queue(v);
            }
        }
        return this.scheduler.suspendCurrent();
    }
    toString() {
        return 'HandlerTask';
    }
}
/**
 * A task that suspends itself after each time it has been run to simulate
 * waiting for data from an external device.
 * @param {Scheduler} scheduler the scheduler that manages this task
 * @constructor
 */
//
class DeviceTask extends BaseTask {
    // scheduler: Scheduler;
    constructor(scheduler) {
        super(scheduler);
        this.v1 = null;
    }
    /**
     * Runs this task, if it is ready to be run, and returns the next task to run.
     */
    run(packet) {
        if (packet == null) {
            if (this.v1 == null) {
                return this.scheduler.suspendCurrent();
            }
            let v = this.v1;
            this.v1 = null;
            return this.scheduler.queue(v);
        }
        else {
            this.v1 = packet;
            return this.scheduler.holdCurrent();
        }
    }
    toString() {
        return 'DeviceTask';
    }
}
class Packet {
    /**
     ** A simple package of data that is manipulated by the tasks.  The exact layout
     ** of the payload data carried by a packet is not importaint, and neither is the
     ** nature of the work performed on packets by the tasks.
     *
     ** Besides carrying data, packets form linked lists and are hence used both as
     ** data and worklists.
     ** @param {Packet} link the tail of the linked list of packets
     ** @param {number} id an ID for this packet
     ** @param {number} kind the type of this packet
     ** @constructor
     **/
    constructor(link, id, kind) {
        this.a1 = 0;
        this.a2 = new Array(DATA_SIZE);
        this.link = link;
        this.kind = kind;
        this.id = id;
    }
    /**
     * Add this packet to the end of a worklist, and return the worklist.
     * @param {Packet} queue the worklist to add this packet to
     */
    addTo(queue) {
        this.link = null;
        if (queue == null) {
            return this;
        }
        let peek;
        let next = queue;
        while ((peek = next.link) != null) {
            next = peek;
        }
        next.link = this;
        return queue;
    }
    toString() {
        return 'packet';
    }
}
class TaskControlBlock {
    /**
     * A task control block manages a task and the queue of work packages associated
     * with it.
     * @param {TaskControlBlock} link the preceding block in the linked block list
     * @param {number} id the id of this block
     * @param {number} priority the priority of this block
     * @param {Packet} queue the queue of packages to be processed by the task
     * @param {Task} task the task
     * @constructor
     */
    constructor(link = null, id, priority, queue, task) {
        const STATE_NUMBER_1 = 1;
        const STATE_NUMBER_2 = 2;
        this.link = link;
        this.id = id;
        this.priority = priority;
        this.queue = queue;
        this.task = task;
        if (this.queue == null) {
            this.state = STATE_NUMBER_2;
        }
        else {
            this.state = STATE_NUMBER_2 | STATE_NUMBER_1;
        }
    }
    setRunning() {
        this.state = STATE_RUNNING;
    }
    markAsNotHeld() {
        this.state = this.state & STATE_NOT_HELD;
    }
    markAsHeld() {
        this.state = this.state | STATE_HELD;
    }
    isHeldOrSuspended() {
        return (this.state & STATE_HELD) !== 0 || this.state === STATE_SUSPENDED;
    }
    markAsSuspended() {
        this.state = this.state | STATE_SUSPENDED;
    }
    markAsRunnable() {
        this.state = this.state | STATE_RUNNABLE;
    }
    /**
     * Runs this task, if it is ready to be run, and returns the next task to run.
     */
    run() {
        let packet;
        if (this.state === STATE_SUSPENDED_RUNNABLE) {
            packet = this.queue;
            this.queue = packet.link;
            if (this.queue == null) {
                //queue is empty, set state STATE_RUNNING
                this.state = STATE_RUNNING;
            }
            else {
                //queue not empty, set state STATE_RUNNABLE
                this.state = STATE_RUNNABLE;
            }
        }
        else {
            packet = null;
        }
        return this.task.run(packet);
    }
    /**
     ** Adds a packet to the worklist of this block's task, marks this as runnable if
     ** necessary, and returns the next runnable object to run (the one
     ** with the highest priority).
     **/
    checkPriorityAdd(task, packet) {
        if (this.queue == null) {
            this.queue = packet;
            this.markAsRunnable();
            if (this.priority > task.priority) {
                return this;
            }
        }
        else {
            this.queue = packet.addTo(this.queue);
        }
        return task;
    }
    toString() {
        let d = '';
        if (this.task) {
            d = `tcb {  (${String(this.task.toString())}) @ \(${String(this.state)}) }`;
        }
        return d;
    }
}
class Scheduler {
    constructor(queueCount, holdCount, currentId, list, currentTcb, blocks) {
        this.queueCount = queueCount | 0;
        this.holdCount = holdCount | 0;
        this.currentId = currentId;
        this.list = list;
        this.currentTcb = currentTcb;
        this.blocks = blocks;
    }
    /**
     * Add an idle task to this scheduler.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     * @param {number} count the number of times to schedule the task
     */
    addIdleTask(id, priority, queue, count) {
        this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
    }
    /**
     * Add a work task to this scheduler.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     */
    addWorkerTask(id, priority, queue) {
        this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
    }
    /**
     * Add a handler task to this scheduler.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     */
    addHandlerTask(id, priority, queue) {
        this.addTask(id, priority, queue, new HandlerTask(this));
    }
    /**
     * Add a handler task to this scheduler.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     */
    addDeviceTask(id, priority, queue) {
        this.addTask(id, priority, queue, new DeviceTask(this));
    }
    /**
     * Add the specified task and mark it as running.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     * @param {Task} task the task to add
     */
    addRunningTask(id, priority, queue, task) {
        this.addTask(id, priority, queue, task);
        this.currentTcb.setRunning();
    }
    /**
     * Add the specified task to this scheduler.
     * @param {number} id the identity of the task
     * @param {number} priority the task's priority
     * @param {Packet} queue the queue of work to be processed by the task
     * @param {Task} task the task to add
     */
    addTask(id, priority, queue, task) {
        this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);
        this.list = this.currentTcb;
        this.blocks[id] = this.currentTcb;
    }
    /**
     * Block the currently executing task and return the next task control block
     * to run.  The blocked task will not be made runnable until it is explicitly
     * released, even if new work is added to it.
     */
    holdCurrent() {
        this.holdCount++;
        this.currentTcb.markAsHeld();
        return this.currentTcb.link;
    }
    /**
     * Suspend the currently executing task and return the next task control block
     * to run.  If new work is added to the suspended task it will be made runnable.
     */
    suspendCurrent() {
        this.currentTcb.markAsSuspended();
        return this.currentTcb;
    }
    /**
     * Add the specified packet to the end of the worklist used by the task
     * associated with the packet and make the task runnable if it is currently
     * suspended.
     * @param {Packet} packet the packet to add
     */
    queue(packet) {
        let t = this.blocks[packet.id];
        if (t == null) {
            return t;
        }
        this.queueCount++;
        packet.link = null;
        packet.id = this.currentId;
        return t.checkPriorityAdd(this.currentTcb, packet);
    }
    /**
     * Execute the tasks managed by this scheduler.
     */
    schedule() {
        var _a;
        this.currentTcb = this.list;
        while (this.currentTcb != null) {
            if (debug) {
                log(`${this.currentTcb.toString()}`);
            }
            if (this.currentTcb.isHeldOrSuspended()) {
                this.currentTcb = (_a = this.currentTcb) === null || _a === void 0 ? void 0 : _a.link;
            }
            else {
                // set next tcb
                this.currentId = this.currentTcb.id;
                this.currentTcb = this.currentTcb.run();
            }
        }
    }
    /**
     ** Release a task that is currently blocked and return the next block to run.
     ** @param {int} id the id of the task to suspend
     **/
    release(id) {
        let tcb = this.blocks[id];
        if (tcb == null) {
            return tcb;
        }
        tcb === null || tcb === void 0 ? void 0 : tcb.markAsNotHeld();
        if (tcb.priority > this.currentTcb.priority) {
            return tcb;
        }
        else {
            return this.currentTcb;
        }
    }
}
/*
 * @State
 * @Tags Jetstream2
 */
class Benchmark {
    /**
     * @Benchmark
     */
    runIteration() {
        const TIME_RADIX = 1000;
        const ITERATION_OUTER = 20;
        const ITRATION_INNER = 50;
        let start = Date.now();
        for (let j = 0; j < ITERATION_OUTER; j++) {
            for (let i = 0; i < ITRATION_INNER; i++) {
                runRichards();
            }
        }
        let end = Date.now();
        console.log(`richards: ms = ${end - start}`);
    }
}
function runRichards() {
    const PRIORITY_1 = 1000;
    const PRIORITY_2 = 2000;
    const PRIORITY_3 = 3000;
    const PRIORITY_4 = 4000;
    const PRIORITY_5 = 5000;
    let scheduler = new Scheduler(0, 0, 0, null, null, new Array(NUMBER_OF_IDS));
    scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);
    let queue = new Packet(null, ID_WORKER, KIND_WORK);
    queue = new Packet(queue, ID_WORKER, KIND_WORK);
    scheduler.addWorkerTask(KIND_WORK, PRIORITY_1, queue);
    //create DEVICE_A Packet
    queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
    queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
    queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
    scheduler.addHandlerTask(ID_HANDLER_A, PRIORITY_2, queue);
    //create DEVICE_B Packet
    queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
    queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
    queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
    scheduler.addHandlerTask(ID_HANDLER_B, PRIORITY_3, queue);
    // add task ID_DEVICE_A
    scheduler.addDeviceTask(ID_DEVICE_A, PRIORITY_4, null);
    // add task ID_DEVICE_B
    scheduler.addDeviceTask(ID_DEVICE_B, PRIORITY_5, null);
    scheduler.schedule();
    // status check
    if (scheduler.queueCount !== EXPECTED_QUEUE_COUNT || scheduler.holdCount !== EXPECTED_HOLD_COUNT) {
        let msg = `Error during execution: queueCount = \(${scheduler.queueCount}) , holdCount = \(${scheduler.holdCount}).`;
        throw new Error(msg);
    }
    else {
        log(`queueCount : ${scheduler.queueCount} ; holdCount : ${scheduler.holdCount}`);
    }
}
let debug = false;
function log(msg) {
    if (debug) {
        console.log(msg);
    }
}
new Benchmark().runIteration();
